منابع مشابه
The Binding Problem(s) 8/25/2010 9:38 AM
The neural binding problem (NBP) encompasses three distinct situations: feature binding, variable binding, and the subjective unity of perception. Feature binding involves associating the correct (visual) features with objects and is fairly well understood. Variable binding arises in natural language and other abstract thought; there are ingenious proposed models, but no experimental confirmati...
متن کاملO-25: Solving the Problem of Infertility among Christians: A Bioethical Appraisal
Background: This paper examines the ethical issues surrounding biological and technological advancement in the area of reproduction so as to ascertain their justifiability or otherwise especially from the Christian point of view. Based on the teaching of the Bible on the sanctity and sacredness of human life, this paper considers the ethical issues surrounding Artificial Womb, Artificial Insemi...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولPharmacoeconomics 2007; 25 (1): 25-37
1 Health Technology Assessment Unit, Institute for Research in Extramural Medicine, VU University Medical Center, Amsterdam, The Netherlands 2 International Health Foundation, Utrecht, The Netherlands 3 Department of General Practice, Institute for Research in Extramural Medicine, VU University Medical Center, Amsterdam, The Netherlands 4 Institute for Research in Extramural Medicine, VU Univer...
متن کاملA fast 25/6-approximation for the minimum unit disk cover problem
Given a point set P in R, the problem of finding the smallest set of unit disks that cover all of P is NPhard. We present a simple algorithm for this problem with an approximation factor of 25/6 in the Euclidean norm and 2 in the max norm, by restricting the disk centers to lie on parallel lines. The run time and space of this algorithm is O(n log n) and O(n) respectively. This algorithm extend...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1982
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90031-0